A Dynamic Algorithm for Line Graph Recognition
نویسندگان
چکیده
For a graph G = (V; E) its line graph L(G) has the node set E and two nodes of L(G) are adjacent if the corresponding edges of G have a common endpoint. The problem of nding G for a given L was already optimally solved by Lehot7] and Roussopoulos10]. Here we present a new dynamic solution to this problem, where we can add or delete a node v in L(G) in time proportional to the size of its adjacency list.
منابع مشابه
Robot Arm Performing Writing through Speech Recognition Using Dynamic Time Warping Algorithm
This paper aims to develop a writing robot by recognizing the speech signal from the user. The robot arm constructed mainly for the disabled people who can’t perform writing on their own. Here, dynamic time warping (DTW) algorithm is used to recognize the speech signal from the user. The action performed by the robot arm in the environment is done by reducing the redundancy which frequently fac...
متن کاملVideo-based face recognition in color space by graph-based discriminant analysis
Video-based face recognition has attracted significant attention in many applications such as media technology, network security, human-machine interfaces, and automatic access control system in the past decade. The usual way for face recognition is based upon the grayscale image produced by combining the three color component images. In this work, we consider grayscale image as well as color s...
متن کاملOpen pit limit optimization using dijkstra’s algorithm
In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies. The extraction of minerals in open mining methods needs a lot of capital investment, which may take several decades. Before the extraction, the p...
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملLine completion number of grid graph Pn × Pm
The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995